Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
نویسندگان
چکیده
منابع مشابه
Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions
In the classical min-max approach to robust combinatorial optimization, a single feasible solution is computed that optimizes the worst case over a given set of considered scenarios. As is well known, this approach is very conservative, leading to solutions that in the average case are far from being optimal. In this paper, we present a different approach: the objective is to compute k feasible...
متن کاملMin-max-min Robust Combinatorial Optimization Subject to Discrete Uncertainty
We consider combinatorial optimization problems with uncertain objective functions. In the min-max-min robust optimization approach, a fixed number k of feasible solutions is computed such that the respective best of them is optimal in the worst case. The idea is to calculate a set of candidate solutions in a potentially expensive preprocessing and then select the best solution out of this set ...
متن کاملMin-max-min robust combinatorial optimization
The idea of k-adaptability in two-stage robust optimization is to calculate a fixed number k of second-stage policies here-and-now. After the actual scenario is revealed, the best of these policies is selected. This idea leads to a min-max-min problem. In this paper, we consider the case where no first stage variables exist and propose to use this approach to solve combinatorial optimization pr...
متن کاملPseudo-polynomial algorithms for min-max and min-max regret problems?
We present in this paper general pseudo-polynomial time algorithms to solve min-max and min-max regret versions of some polynomial or pseudo-polynomial problems under a constant number of scenarios. Using easily computable bounds, we can improve these algorithms. This way we provide pseudo-polynomial algorithms for the min-max and and min-max regret versions of several classical problems includ...
متن کاملMin-max and min-max regret versions of some combinatorial optimization problems: a survey
Min-max and min-max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then, we survey complexity results for the min-max and min-max regret versions of some combinatorial optimization problems: shortest path, spanning tree, assignment, cut, s-t cut, knapsack. Since most of these problems are NP-hard, we also inv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2019
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2019.05.045